Categoricity Spectra for Rigid Structures
نویسندگان
چکیده
منابع مشابه
Categoricity Spectra for Rigid Structures
For a computable structure M , the categoricity spectrum is the set of all Turing degrees capable of computing isomorphisms among arbitrary computable copies of M . If the spectrum has a least degree, this degree is called the degree of categoricity of M . In this paper we investigate spectra of categoricity for computable rigid structures. In particular, we give examples of rigid structures wi...
متن کاملEffective categoricity of equivalence structures
We investigate effective categoricity of computable equivalence structures A. We show that A is computably categorical if and only if A has only finitely many finite equivalence classes, or A has only finitely many infinite classes, bounded character, and at most one finite k such that there are infinitely many classes of size k. We also prove that all computably categorical structures are rela...
متن کاملEffective Categoricity of Injection Structures
We study computability theoretic properties of computable injection structures and the complexity of isomorphisms between these
متن کاملEffective Categoricity of Equivalence Structures FINAL DRAFT
We consider only countable structures for computable languages with universe ω. We identify sentences with their Gödel codes. The atomic diagram of a structure A for L is the set of all quantifier-free sentences in LA, L expanded by constants for the elements in A, which are true in A. A structure is computable if its atomic diagram is computable. In other words, a structure A is computable if ...
متن کاملDegrees of categoricity of computable structures
Defining the degree of categoricity of a computable structureM to be the least degree d for whichM is d-computably categorical, we investigate which Turing degrees can be realized as degrees of categoricity. We show that for all n, degrees d.c.e. in and above 0 can be so realized, as can the degree 0.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Notre Dame Journal of Formal Logic
سال: 2016
ISSN: 0029-4527
DOI: 10.1215/00294527-3322017